An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling
نویسندگان
چکیده
منابع مشابه
Genetic Programming Based Hyper-heuristics for Dynamic Job Shop Scheduling: Cooperative Coevolutionary Approaches
Job shop scheduling (JSS) problems are optimisation problems that have been studied extensively due to their computational complexity and application in manufacturing systems. This paper focuses on a dynamic JSS problem to minimise the total weighted tardiness. In dynamic JSS, jobs’ attributes are only revealed after they arrive at the shop floor. Dispatching rule heuristics are prominent appro...
متن کاملA Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling
We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics compo...
متن کاملInvestigating the Generality of Genetic Programming Based Hyper-heuristic Approach to Dynamic Job Shop Scheduling with Machine Breakdown
Dynamic job shop scheduling (DJSS) problems are combinatorial optimisation problems that have been extensively studied in the literature due to their difficulty and their applicability to real-world manufacturing systems, e.g., car manufacturing systems. In a DJSS problem instance, jobs arrive on the shop floor to be processed on specific sequences of machines on the shop floor and unforeseen e...
متن کاملReference Point Adaption Method for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop Scheduling
Job Shop Scheduling is an important combinatorial optimisation problem in practice. It usually contains many (four or more) potentially conflicting objectives such as makespan and mean weighted tardiness. On the other hand, evolving dispatching rules using genetic programming has demonstrated to be a promising approach to solving job shop scheduling due to its flexibility and scalability. In th...
متن کاملDynamic Job Shop Scheduling Under Uncertainty Using Genetic Programming
Job shop scheduling(JSS) is a hard problem with most of the research focused on scenarios with the assumption that the shop parameters such as processing times, due dates are constant. But in the real world uncertainty in such parameters is a major issue. In this work, we investigate a genetic programming based hyper-heuristic approach to evolving dispatching rules suitable for dynamic job shop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2018
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2017.11.020